Lightweight Hardware Implementation of Binary Ring-LWE PQC Accelerator

نویسندگان

چکیده

Significant innovation has been made in the development of public-key cryptography that is able to withstand quantum attacks, known as post-quantum (PQC). This paper focuses on an efficient PQC hardware implementation. Specifically, implementation binary Ring-learning-with-errors (BRLWE)-based encryption scheme, a promising lightweight suitable for resource-constrained applications, proposed. The first develops mathematical formulation present proposed algorithmic process. corresponding accelerators are then described detail. Finally, comparisons with previous implementations provided demonstrate superior performance design. For instance, low-complexity accelerator 34.7% less area-delay product (ADP) than state-of-the-art design $n=256$ field-programmable gate array (FPGA) platform. Apart from efficiency architectures, also complete input/output processing setup, and thus feasible emerging applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binary Ring-LWE Hardware with Power Side-Channel Countermeasures

We describe the first hardware implementation of a quantum-secure encryption scheme along with its lowcost power side-channel countermeasures. The encryption uses an implementation-friendly Binary-Ring-Learning-with-Errors (BRLWE) problem with binary errors that can be efficiently generated in hardware. We demonstrate that a direct implementation of BRLWE exhibits vulnerability to power side-ch...

متن کامل

A Masked Ring-LWE Implementation

Lattice-based cryptography has been proposed as a postquantum public-key cryptosystem. In this paper, we present a masked ringLWE decryption implementation resistant to first-order side-channel attacks. Our solution has the peculiarity that the entire computation is performed in the masked domain. This is achieved thanks to a new, bespoke masked decoder implementation. The output of the ring-LW...

متن کامل

Large Modulus Ring-LWE ≥ Module-LWE

We present a reduction from the module learning with errors problem (MLWE) in dimension d and with modulus q to the ring learning with errors problem (RLWE) with modulus q. Our reduction increases the LWE error rate α by a quadratic factor in the ring dimension n and a square root in the module rank d for power-of-two cyclotomics. Since, on the other hand, MLWE is at least as hard as RLWE, we c...

متن کامل

Practical CCA2-Secure and Masked Ring-LWE Implementation

During the last years public-key encryption schemes based on the hardness of ring-LWE have gained significant popularity. For realworld security applications assuming strong adversary models, a number of practical issues still need to be addressed. In this work we thus present an instance of ring-LWE encryption that is protected against active attacks (i.e., adaptive chosen-ciphertext attacks) ...

متن کامل

Challenges for Ring-LWE

As lattice cryptography becomes more widely used in practice, there is an increasing need for further cryptanalytic effort and higher-confidence security estimates for its underlying computational problems. Of particular interest is a class of problems used in many recent implementations, namely, Learning With Errors (LWE), its more efficient ring-based variant Ring-LWE, and their “deterministi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Computer Architecture Letters

سال: 2022

ISSN: ['2473-2575', '1556-6056', '1556-6064']

DOI: https://doi.org/10.1109/lca.2022.3160394